Euclidean simplices generating discrete reflection groups
نویسندگان
چکیده
Let P be a convex polytope in the spherical space S, in the Euclidean space E, or in the hyperbolic space H. Consider the group GP generated by reflections in the facets of P . We call GP a reflection group generated by P . The problem we consider in this paper is to list polytopes generating discrete reflection groups. The answer is known only for some combinatorial types of polytopes. Already in 1873, Schwarz [10] listed spherical triangles generating discrete groups. In 1998, E. Klimenko and M. Sakuma [9] solved the problem for hyperbolic triangles. In [2], [4], [3], [5] the problem was solved for hyperbolic quadrilaterals, compact hyperbolic pyramids and triangular prisms, hyperbolic simplices, and Lambert cubes in S, E, H. In [6] the problem was solved for spherical simplices.
منابع مشابه
Geometry of simplices in Minkowski spaces
There are many problems and configurations in Euclidean geometry that were never extended to the framework of (normed or) finite dimensional real Banach spaces, although their original versions are inspiring for this type of generalization, and the analogous definitions for normed spaces represent a promising topic. An example is the geometry of simplices in non-Euclidean normed spaces. We pres...
متن کاملThe Dissection of Five-dimensional Simplices into Orthoschemes
In this paper the dissection of ve-dimensional simplices into or-thoschemes is shown. Firstly, some general methods for dissecting n-dimensional Euclidean simplices are described. For this, a description of simplices by graphs is given. All methods for cutting a simplex are investgated with the help of these graphs. The dissection of the ve-dimensional Euclidean simplices is thoroughly investig...
متن کاملSimplices and Spectra of Graphs
I Let Tn be the set of congruence classes of simplices in Euclidean space E . The set Tn is an open manifold (also a semi-algebraic set) of dimension (n + 1)n/2. Coincidentally, a simplexT ∈ Tn is determined by the (n+1)n/2 lengths of its edges. Furthermore, the square of the volume of T ∈ Tn is a polynomial in the squares of the edgelengths. This polynomial is given by the Cayley-Me...
متن کاملTracking a Generator by Persistence
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute not only the persistent homology for a filtered simplicial complex, but also representative generating cycles for persistent homology groups. However, if there are dynamic changes either in the filtration or in the underlyi...
متن کاملOrthocenters of Simplices on Spheres
We consider orthocenters of simplices of the unit sphere of the ndimensional Euclidean space. For n = 3, orthocenters always exist for all simplices, but for n ≧ 4, they do not necessarily exist. Moreover, unlike the case of the Euclidean space, it is possible that there exist infinite numbers of orthocenters. In this paper, we give characterizations of the existence and the uniqueness of ortho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007